|
In a conventional finite state machine, the transition is associated with a set of input Boolean conditions and a set of output Boolean functions. In an extended finite state machine (EFSM) model, the transition can be expressed by an “if statement” consisting of a set of trigger conditions. If trigger conditions are all satisfied, the transition is fired, bringing the machine from the current state to the next state and performing the specified data operations. ==Definition== An EFSM is defined〔 〕 as a 7-tuple where * S is a set of symbolic states, * I is a set of input symbols, * O is a set of output symbols, * D is an n-dimensional linear space , * F is a set of ''enabling functions'' , * U is a set of ''update functions'' , * T is a transition relation, 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Extended finite-state machine」の詳細全文を読む スポンサード リンク
|